Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs

The numerical approximation of parametric partial differential equations is a computational challenge, in particular when the number of involved parameter is large. This paper considers a model class of second order, linear, parametric, elliptic PDEs on a bounded domain D with diffusion coefficients depending on the parameters in an affine manner. For such models, it was shown in [11, 12] that ...

متن کامل

Tensor-Structured Galerkin Approximation of Parametric and Stochastic Elliptic PDEs

We investigate the convergence rate of approximations by finite sums of rank-1 tensors of solutions of multi-parametric elliptic PDEs. Such PDEs arise, for example, in the parametric, deterministic reformulation of elliptic PDEs with random field inputs, based for example, on the M -term truncated Karhunen-Loève expansion. Our approach could be regarded as either a class of compressed approxima...

متن کامل

Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDEs

Parametric partial differential equations are commonly used to model physical systems. They also arise when Wiener chaos expansions are used as an alternative to Monte Carlo when solving stochastic elliptic problems. This paper considers a model class of second order, linear, parametric, elliptic PDEs in a bounded domain D with coefficients depending on possibly countably many parameters. It sh...

متن کامل

Sparse polynomial approximation of parametric elliptic PDEs Part II: lognormal coefficients *

We consider the linear elliptic equation −div(a∇u) = f on some bounded domain D, where a has the form a = exp(b) with b a random function defined as b(y) = ∑ j≥1 yjψj where y = (yj) ∈ RN are i.i.d. standard scalar Gaussian variables and (ψj)j≥1 is a given sequence of functions in L∞(D). We study the summability properties of Hermite-type expansions of the solution map y 7→ u(y) ∈ V := H 0 (D), ...

متن کامل

Discrete least squares polynomial approximation with random evaluations – application to parametric and stochastic elliptic PDES

Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate functions based on random sampling according to a given probability measure. Recent work has shown that in the univariate case, the least-squares method is quasi-optimal in expectation in [8] and in probability in [20], under suitable condition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ESAIM: Mathematical Modelling and Numerical Analysis

سال: 2012

ISSN: 0764-583X,1290-3841

DOI: 10.1051/m2an/2012027